Faster Sorting and Routing on Grids with Diagonals
نویسندگان
چکیده
We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half the on principle smallest number given by the bisection bound for grids without diagonals.
منابع مشابه
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals 1
We present deterministic sorting and routing algorithms for grids and tori with additional diagonal connections. For large loads (h 12), where each processor has at most h data packets in the beginning and in the end, the sorting problem can be solved in optimal hn=6 + o(n) and hn=12 + o(n) steps for grids and tori with diagonals, respectively. For smaller loads, we present a new concentration ...
متن کاملOptimal Deterministic Sorting and
We present deterministic sorting and routing algorithms for grids and tori with additional diagonal connections. For large loads (h 12), where each processor has at most h data packets in the beginning and in the end, the sorting problem can be solved in optimal hn=6 + o(n) and hn=12 + o(n) steps for grids and tori with diagonals, respectively. For smaller loads, we present a new concentration ...
متن کاملRouting on Triangles, Tori and Honeycombs
The standard n n torus consists of two sets of axes: horizontal and vertical ones. For routing h-relations, the bisection bound gives a lower bound of h n=4. Several algorithms nearly matching this bound have been given. In this paper we analyze the routing capacity of modiied tori: tes-sellations of the plane with triangles or hexagons and tori with added diagonals. On some of these networks t...
متن کاملOptimal Average Case Sorting on Arrays
We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کامل